An Improved Pseudo-random Generator Based on Discrete Log
نویسنده
چکیده
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponentiations. Using an implementation with quite small precomputation tables, this yields a rate of more than 20 bits per modular multiplication, thus much faster than the the squaring (BBS) generator with similar parameters.
منابع مشابه
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for this function. We consider a special case of this problem, the discrete logarithm with short exponents, which is also believed to be hard to compute. Under this intractibility assumption we show that discrete exponent...
متن کاملEfficient Primitives from Exponentiation in Zp
Since Diffie-Hellman [14], many secure systems, based on discrete logarithm or DiffieHellman assumption in Zp, were introduced in the literature. In this work, we investigate the possibility to construct efficient primitives from exponentiation techniques over Zp. Consequently, we propose a new pseudorandom generator, where its security is proven under the decisional Diffie-Hellman assumption. ...
متن کاملEvaluating Quality of Chaotic Pseudo-Random Generators: Application to Information Hiding
Guaranteeing the security of information transmitted through the Internet, against passive or active attacks, is a major concern. The discovery of new pseudo-random number generators with a strong level of security is a field of research in full expansion, due to the fact that numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the confer...
متن کاملAn Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...
متن کاملA Fast Java Implementation of a Provably Secure Pseudo Random Bit Generator Based on the Elliptic Curve Discrete Logarithm Problem
We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(Fp) of rational points on an elliptic curve over a finite prime field Fp. The bit generator is implemented within the framework of the Java Cryptography Architecture (JCA). It uses an elliptic curve E chosen such that both E(Fp) and its twist E (Fp) are of prim...
متن کامل